Correction to the paper “ Logics preserving degrees of truth from varieties of residuated lattices ”
نویسندگان
چکیده
A wrong argument in the proof of one of the main results in the paper is corrected. The result itself remains true. The right proof incorporates the basic ideas in the originally alleged proof, but in a more restricted construction. The proof of the last implication in Theorem 4.4 of the referenced paper [1] is wrong. At a certain point, it performs a construction on an arbitrary algebra but the properties used in its development implicitly assume that the algebra is in fact a residuated lattice, which it need not be. Here we present a correct proof done by working only in the formula algebra, following the same ideas and performing essentially the same construction, modulo a certain crucial lemma that characterizes the supremum operation in the lattice of theories of one of the logics considered in [1]. Let us recall the necessary background. Let K be an arbitrary variety of commutative, integral residuated lattices. The paper [1] studies two finitary logics associated with each such K , which are denoted by their consequence relations: The first one, denoted by `K , is the truth-preserving logic determined by the algebras in K when their maximum 1 (which is also the unit of the monoid structure of the fusion operation ? ) is taken as representing truth; the second one, denoted by |=K , is the logic preserving degrees of truth determined by the ordering relation of the algebras in K (which are always lattices). More precisely: φ0, . . . ,φn−1 `K ψ ⇐⇒ ∀A ∈ K ,∀v ∈ Hom(Fm,A) , if v(φi) = 1 for all i < n, then v(ψ) = 1. / 0 `K ψ ⇐⇒ ∀A ∈ K ,∀v ∈ Hom(Fm,A) , v(ψ) = 1. φ0, . . . ,φn−1 |=K ψ ⇐⇒ ∀A ∈ K ,∀v ∈ Hom(Fm,A) ,∀a ∈ A , if v(φi)> a for all i < n, then v(ψ)> a. / 0 |=K ψ ⇐⇒ ∀A ∈ K ,∀v ∈ Hom(Fm,A) , v(ψ) = 1.
منابع مشابه
Logics preserving degrees of truth from varieties of residuated lattices
A wrong argument in the proof of one of the main results in the paper is corrected. The result itself remains true. The right proof incorporates the basic ideas in the originally alleged proof, but in a more restricted construction.
متن کاملA first approach to the Deduction-Detachment Theorem in logics preserving degrees of truth
This paper studies the DeductionDetachment Theorem (DDT) in the realm of logics associated with bounded, commutative and integral residuated lattices whose consequence relation preserves degrees of truth (strictly speaking, it preserves the lower bounds of truth values of the premises). It is given some necessary conditions that must enjoy the varieties with a logic having the DDT. In two parti...
متن کاملLogics Preserving Degrees of Truth from Varieties of Residuated Lattices
Let K be a variety of (commutative, integral) residuated lattices. The substructural logic usually associated with K is an algebraizable logic that has K as its equivalent algebraic semantics, and is a logic that preserves truth, i.e. 1 is the only truth value preserved by the inferences of the logic. In this article, we introduce another logic associated with K, namely the logic that preserves...
متن کاملEQ-logics with delta connective
In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...
متن کاملTaking Degrees of Truth Seriously
This is a contribution to the discussion on the role of truth degrees in manyvalued logics from the perspective of abstract algebraic logic. It starts with some thoughts on the so-called Suszko's Thesis (that every logic is two-valued) and on the conception of semantics that underlies it, which includes the truthpreserving notion of consequence. The alternative usage of truth values in order to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010